Study on Two Dimensional Parallel Jets

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Numerical Study of Interaction of Two Plane Parallel Jets

In the present work, a numerical simulation of two parallel turbulent jets was performed. The simulations were carried out by using the  standard, the  standard and the RSM models. A parametric study was also presented to determine the effect of the nozzles spacing and velocity ratio on the axial and transverse positions of the merge and combined points. Correlations between the various paramet...

متن کامل

Experimental Study of Parallel Jets Scouring, considering the effect of jets distance on erosion rate

The scouring process at downstream of the hydraulic structures is a complex phenomenon and many parameters affecting its amount. Failure to control this phenomenon causes damages to the dam and its associated hydraulic structures. In this research, the scouring caused by the combination of jets outlet from a gated spillway was investigated experimentally and the combination of jets adjacent to ...

متن کامل

On two-dimensional Cayley graphs

A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....

متن کامل

Parallel Turing Machines on a Two-Dimensional Tape

We introduce two models of parallel twodimensional Turing machine with different possibilities of communication among control units and we compare them.

متن کامل

Optimal Parallel Two Dimensional Text Searching on a CREW PRAM

We present a parallel algorithm for two dimensional text searching over a general alphabet. This algorithm is optimal in two ways. First, the total number of operations on the text is linear. Second, the algorithm takes time O(log m) on a CREW PRAM (where m is the length of the longest dimension of the pattern), thus matching the lower bound for string matching on a PRAM without concurrent writ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the Japan Society of Mechanical Engineers

سال: 1977

ISSN: 0029-0270,2185-9485

DOI: 10.1299/kikai1938.43.1378